#define _CRT_SECURE_NO_WARNINGS 1

//https://leetcode.cn/problems/two-sum/

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> hash;
        for (int i = 0; i < nums.size(); i++)
        {
            int x = target - nums[i];
            if (hash.count(x))
            {
                return { hash[target - nums[i]],i };
            }

            hash[nums[i]] = i;
        }
        return { -1,-1 };
    }
};